Completeness and Consistency in a Rule-Based System
نویسندگان
چکیده
The builders of a knowledge-based expert system must ensure that the system will give its users accurate advice or correct solutions to their problems. The process of verifying that a system is accurate and reliable has two distinct components: checking that the knowledge base is correct, and verifying that the program can interpret and apply this information correctly. The first of these components has been the focus of the research described in this chapter; the second is discussed in Part Ten (Chapters 30 and 31). Knowledge base debug,~ng, the process of checking that a knowledge base is correct and complete, is one component of the larger problem of knowledge acquisition. This process involves testing and refining the system’s knowledge in order to discover and correct a variety of errors that can arise during the process of transferring expertise from a human expert to a computer system. In this chapter, we discuss some common problems in knowledge acquisition and debugging and describe an automated assistant for checking the completeness and consistency of the knowledge base in the ONCOCIN system (discussed in Chapters 32 and 35). As discussed in Chapters 7 and 9, an expert’s knowledge must undergo a number of transformations before it can be used by a computer. First, the person acquires expertise in some domain through study, research, and experience. Next, the expert attempts to formalize this expertise and to express it in the internal representation of an expert system. Finally, the
منابع مشابه
Equality propositional logic and its extensions
We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...
متن کاملOn Generating FC Fuzzy Rule Systems from Data Using Evolution Strategies
Sophisticated fuzzy rule systems are supposed to be flexible, complete, consistent and compact (FC). Flexibility, completeness and consistency are essential for fuzzy systems to exhibit an excellent performance and to have a clear physical meaning, while compactness is crucial when the number of the input variables increases. However, the completeness and consistency conditions are often violat...
متن کاملOn generating FC3 fuzzy rule systems from data using evolution strategies
Sophisticated fuzzy rule systems are supposed to be flexible, complete, consistent and compact (FC(3)). Flexibility, and consistency are essential for fuzzy systems to exhibit an excellent performance and to have a clear physical meaning, while compactness is crucial when the number of the input variables increases. However, the completeness and consistency conditions are often violated if a fu...
متن کاملEntropy Based Fuzzy Rule Weighting for Hierarchical Intrusion Detection
Predicting different behaviors in computer networks is the subject of many data mining researches. Providing a balanced Intrusion Detection System (IDS) that directly addresses the trade-off between the ability to detect new attack types and providing low false detection rate is a fundamental challenge. Many of the proposed methods perform well in one of the two aspects, and concentrate on a su...
متن کاملLearning in an Inconsistent World: Rule Selection in Aq18 Learning in an Inconsistent World Rule Selection in Star/aq18 Learning in an Inconsistent World: Rule Selection in Star/aq18
In concept learning and data mining tasks, the learner is typically faced with a choice of many possible hypotheses generalizing the input data. If one can assume that training data contains no noise, then the primary conditions a hypothesis must satisfy are consistency and completeness with regard to the data. In real-world applications, however, data are often noisy, and the insistence on the...
متن کاملUsing Qualitative Reasoning to Understand Financial Arithmetic
This paper describes a general mechanism for the qualitative interpretation of simple arithmetic relations. This mechanism is useful for the understanding and reasoning about domains that can be modeled by systems of simple arithmetic equations. Our representation attempts to model the underlying arithmetic in its complete detail. Reasoning from these forms provides the completeness and consist...
متن کامل